Secrecy Capacity Scaling in Large Cooperative Wireless Networks
نویسندگان
چکیده
منابع مشابه
Capacity scaling in large wireless networks
We consider networks consisting of nodes with radios, and without any wired infrastructure, thus necessitating all communication to take place only over shared wireless medium. We focus mainly on the flat fading channel model. We study capacity scaling laws in such systems when the number of nodes gets large. We show that in extended networks (network with constant density of users) capacity sc...
متن کاملA Capacity Theorem for Cooperative Multicasting in Large Wireless Networks
We consider a scenario in which a sender wishes to broadcast a common message to a large number of receivers in a slowly fading wireless environment. We exploit cooperation between the receivers but impose an average sum power constraint across the network. As the number of receivers K → ∞, there is a critical rate C for the common message such that the outage probability of every receiver appr...
متن کاملScaling Laws of Capacity for Large Scale Wireless Networks
In this paper, we focus on the networking-theoretic multicast capacity bounds for both random extended networks (REN) and random dense networks (RDN) under Gaussian Channel model, when all wireless nodes have the same constant transmission power P . During the transmission, the power decays along path with attenuation exponent α > 2. In REN and RDN, n nodes are randomly distributed in the squar...
متن کاملCapacity scaling of large wireless networks with heterogeneous clusters
We analyze the capacity scaling laws of wireless networks where the spatial distribution of nodes over the network area exhibits a high degree of clustering. In particular we consider the presence of heterogeneous clusters, both in size and in population, which are common in many real systems. We completely characterize the scaling exponent of the resulting network capacity by providing upper a...
متن کاملCapacity-Delay Scaling in Arbitrary Wireless Networks
Gupta and Kumar (2000) studied capacity scaling in random wireless networks with n nodes under the protocol interference model. They showed that the per source-destination pair capacity scales as Θ(1/ √ n logn) when n distinct random source-destination pairs communicate simultaneously. For the same setup, El Gamal, Mammen, Prabhakar and Shah (2004) showed that the delay scales as Θ( √ n/ logn)....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2645227